Parallel Genetic Algorithm for Capacitated P-median Problem
نویسندگان
چکیده
منابع مشابه
An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملMatheuristics for the capacitated p-median problem
The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve...
متن کاملParallel Genetic Algorithm for the Capacitated Lot-Sizing Problem
A parallel genetic algorithm is presented to solve the well-known ca-pacitated lot-sizing problem. The approach is implemented on a massively parallel single instruction multiple data architecture with 16384 4-bit processors. Based on a random keys representation a schedule is backward oriented obtained which enables us to apply a very simple capacity check. Genetic algorithms are a general pur...
متن کاملA Genetic Algorithm for the P-Median Problem
Facility-location problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated pmedian problem. The proposed GA use...
متن کاملA Genetic Algorithm For P-Median Location Problem
In this paper, we have proposed a new genetic algorithm for p-median location problem. In this regard, prior genetic algorithms were designed for p-median location problem by proposing several methods that are used in generation of initial population, crossover and mutation operators, and new operator socalled re-allocation has been incorporated into the algorithm that causes to find the optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2017
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2017.06.054